Higher-Order Pattern Anti-Unification in Linear Time

Higher-Order Pattern Anti-Unification in Linear Time

Higher-Order Pattern Anti-Unification in Linear Time

Higher-Order Pattern Anti-Unification in Linear Time

Higher-Order Pattern Anti-Unification in Linear Time

Higher-Order Equational Pattern Anti-Unification∗

We consider anti-unification for simply typed lambda terms in associative, commutative, and associative-commutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the form of higher-order patterns. The problem is finitary: the minimal complete set of generalizations contains finitely many elements. We define the notion of o...